On nonsingular M-matrices
نویسندگان
چکیده
منابع مشابه
New results on nonsingular power LCM matrices
Let e and n be positive integers and S = {x1, . . . , xn} be a set of n distinct positive integers. The n × n matrix having eth power [xi, xj ] of the least common multiple of xi and xj as its (i, j)-entry is called the eth power least common multiple (LCM) matrix on S, denoted by ([S]). The set S is said to be gcd closed (respectively, lcm closed) if (xi, xj) ∈ S (respectively, [xi, xj ] ∈ S) ...
متن کاملSome New Bounds on the Minimum Eigenvalue of Nonsingular M -Matrices
If A is a nonsingular M -matrix, some new upper and lower bounds on the minimum eigenvalue τ(A) of A are given. These bounds improve some results of Tian and Huang and are more accurate than Li et al. in some cases. In addition, we obtain some new bounds on the minimum eigenvalue of a nonsingular M -matrix A , which can give affirmative conclusions about whether bounds for the minimum eigenvalu...
متن کاملExtremal properties of ray-nonsingular matrices
A ray–nonsingular matrix is a square complex matrix, A, such that each complex matrix whose entries have the same arguments as the corresponding entries of A is nonsingular. Extremal properties of ray– nonsingular matrices are studied in this paper. Combinatorial and probabilistic arguments are used to prove that if the order of a ray– nonsingular matrix is at least 6, then it must contain a ze...
متن کاملEfficient Generation of Random Nonsingular Matrices
We present an eecient algorithm for generating an n n nonsingular matrix uniformly over a nite eld. This algorithm is useful for several cryptographic and checking applications. Over GFF2] our algorithm runs in expected time M(n) + O(n 2), where M(n) is the time needed to multiply two n n matrices, and the expected number of random bits it uses is n 2 + 3. (Over other nite elds we use n 2 + O(1...
متن کاملRow Coincidences in Nonsingular Binary Matrices
Nous étudions le nombre de cöıncidences des chiffres uns dans chaque paire de lignes différentes d’une matrice binaire et inversible dont toutes les lignes contiennent la même quantité d’unités. Nous présentons des bornes pour ce nombre, et nous démontrons que ces bornes peuvent être atteintes. Que la borne inférieure peut être réalisée est démontré par moyen des exemples. Quant à la borne supé...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1993
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)90252-j